Tester Structure Expression Language and Its Application to the Environment for VLSI Tester Program Development
نویسندگان
چکیده
منابع مشابه
Tester Structure Expression Language and Its Application to the Environment for VLSI Tester Program Development
VLSI chips have been tested using various automatic test equipment (ATE). Although each ATE has a similar structure, the language for ATE is proprietary and it is not easy to convert a test program for use among different ATE vendors. To address this difficulty we propose a tester structure expression language, a tester language with a novel format. The developed language is called the general ...
متن کاملUw Vlsi Chip Tester
We present a design for a low-cost, functional VLSI chip tester. It is based on the Apple Macintosh II personal computer. It tests chips that have up to 128 pins. All pin drivers of the tester are bidirectional; each pin is programmed independently as an input or an output. The tester can test both static and dynamic chips. Rudimentary speed testing is provided. Chips are tested by executing C ...
متن کاملthe underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولTesting The Tester
0-7803-7542-4/02 $17.00 © 2002 IEEE SP1.3 ITC INTERNATIONAL TEST CONFERENCE TESTING THE TESTER Rochit Rajsuman Advantest America R & D Center, Inc. 3201 Scott Boulevard Santa Clara, CA, 95054 The end use of a tester is to test ICs; hence, it is imperative that the tester itself should function correctly. A broad strategy is employed to detect and remove component level faults from various hardw...
متن کاملA better tester for bipartiteness?
Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is ε-far from bipartite, then the subgraph induced by a random subset of Õ(1/ε) vertices is bipartite with high probability. We conjecture that the induced subgraph is Ω̃(ε)-far from bipartite with high probability. Gonen and Ron (RANDOM 2007) proved this conjecture in the case when the degrees of all vertic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing Systems
سال: 2008
ISSN: 1976-913X
DOI: 10.3745/jips.2008.4.4.121